MAXIMIZING THE GROWTH RATE UNDER RISK CONSTRAINTS
نویسندگان
چکیده
منابع مشابه
Maximizing Privacy under Data Distortion Constraints in Noise Perturbation Methods
This paper introduces the ‘guessing anonymity,’ a definition of privacy for noise perturbation methods. This definition captures the difficulty of linking identity to a sanitized record using publicly available information. Importantly, this definition leads to analytical expressions that bound data privacy as a function of the noise perturbation parameters. Using these bounds, we can formulate...
متن کاملMaximizing Non-monotone Submodular Functions under Matroid and Knapsack Constraints
Submodular function maximization is a central problem in combinatorial optimization, generalizing many important problems including Max Cut in directed/undirected graphs and in hypergraphs, certain constraint satisfaction problems, maximum entropy sampling, and maximum facility location problems. Unlike submodular minimization, submodular maximization is NP-hard. In this paper, we give the firs...
متن کاملMaximizing Network Lifetime under QoS Constraints in Wireless Sensor Networks
In this paper, we study a randomized scheduling algorithm, and analyze the problem of maximizing network lifetime under Quality of Service constraints such as bounded values of detection delay, detection probability, and network coverage intensity in wireless sensor networks. We show that the optimal solutions exist and provide the conditions of the existence of the optimal solutions. KeywordsW...
متن کاملMaximizing Nonmonotone Submodular Functions under Matroid or Knapsack Constraints
Submodular function maximization is a central problem in combinatorial optimization, generalizing many important problems including Max Cut in directed/undirected graphs and in hypergraphs, certain constraint satisfaction problems, maximum entropy sampling, and maximum facility location problems. Unlike submodular minimization, submodular maximization is NP-hard. In this paper, we give the firs...
متن کاملMaximizing Submodular Functions under Matroid Constraints by Evolutionary Algorithms
Many combinatorial optimization problems have underlying goal functions that are submodular. The classical goal is to find a good solution for a given submodular function f under a given set of constraints. In this paper, we investigate the runtime of a simple single objective evolutionary algorithm called (1 + 1) EA and a multiobjective evolutionary algorithm called GSEMO until they have obtai...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Finance
سال: 2009
ISSN: 0960-1627,1467-9965
DOI: 10.1111/j.1467-9965.2009.00378.x